The complexity of first-order and monadic second-order logic revisited
نویسندگان
چکیده
منابع مشابه
The Complexity of First-Order and Monadic Second-Order Logic Revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower bounds for fixed-parameter tractable model-checking problems for first-order and monadic second-order logic. We show that unless PTIME = NP, the model-checking problem for monadic second-order logic on finite words is...
متن کاملFirst order quantifiers in~monadic second order logic
This paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order logic, extending the toolkit of Janin and Marcinkowski [JM01]. We introduce an operation existsn(S) on properties S that says “there are n components having S”. We use this operation to show that under natural strictness conditions, adding a first order quantifier word u to th...
متن کاملAsymptotic Monadic Second-Order Logic
In this paper we introduce so-called asymptotic logics, logics that are meant to reason about weights of elements in a model in a way inspired by topology. Our main subject of study is Asymptotic Monadic Second-Order Logic over infinite words. This is a logic talking about ωwords labelled by integers. It contains full monadic second-order logic and can express asymptotic properties of integers ...
متن کاملThe Complexity of Monadic Second-Order Unification
Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding whether a set of monadic equations has a unifier is NP-complete, where we use the technique of compressing solutions using singleton context-free grammars. We prove that monadic second-order matching is also NP-complete.
متن کاملProbabilistic Inference and Monadic Second Order Logic
This paper combines two classic results from two different fields: the result by Lauritzen and Spiegelhalter [21] that the probabilistic inference problem on probabilistic networks can be solved in linear time on networks with a moralization of bounded treewidth, and the result by Courcelle [10] that problems that can be formulated in counting monadic second order logic can be solved in linear ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2004
ISSN: 0168-0072
DOI: 10.1016/j.apal.2004.01.007